A Kinematic Turing Machine
نویسنده
چکیده
A Turing Machine in a three dimensional discrete space environment containing movable cubic parts is described. All of the cubic parts are identical in function. The only function that a part performs is to move a neighbouring part by one unit. Parts can be connected to neighbouring parts. When one part moves, parts that it is connected to also move. An example program for the Turing Machine is given.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملBayesian perspective over time
Thomas Bayes, the founder of Bayesian vision, entered the University of Edinburgh in 1719 to study logic and theology. Returning in 1722, he worked with his father in a small church. He also was a mathematician and in 1740 he made a novel discovery which he never published, but his friend Richard Price found it in his notes after his death in 1761, reedited it and published it. But until L...
متن کاملForward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning
The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...
متن کاملFrom Machine and Tape to Structure and Function: Formulation of a Reflexively Computing System
The relationship between structure and function is explored via a system of labeled directed graph structures upon which a single elementary read/write rule is applied locally. Boundaries between static (information-carrying) and active (information-processing) objects, imposed by mandate of the rules or physics in earlier models, emerge instead as a result of a structure-function dynamic that ...
متن کاملExperimental computation of real numbers by Newtonian machines
Following a methodology we have proposed for analysing the nature of experimental computation, we prove that there is a 3-dimensional Newtonian machine which given any point x ∈ [0, 1] can generate an infinite sequence [p of rational number interval approximations that converges to x as n → ∞. The machine is a system for scattering and collecting particles. The theorem implies that every point ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJUC
دوره 5 شماره
صفحات -
تاریخ انتشار 2009